Approximate Generalized Inverses with Iterative Refinement for $\epsilon$-Accurate Preconditioning of Singular Systems
نویسندگان
چکیده
Approximate Generalized Inverses with Iterative Refinement for $\epsilon$-Accurate Preconditioning of Singular Systems
منابع مشابه
Parallel Preconditioning with Sparse Approximate Inverses
A parallel preconditioner is presented for the solution of general sparse linear systems of equations. A sparse approximate inverse is computed explicitly and then applied as a preconditioner to an iterative method. The computation of the preconditioner is inherently parallel, and its application only requires a matrix-vector product. The sparsity pattern of the approximate inverse is not impos...
متن کاملApproximate Inverse Preconditioning of Iterative Methods for Nonsymmetric Linear Systems
A method for computing an incomplete factorization of the inverse of a nonsymmetric matrix A is presented. The resulting factorized sparse approximate inverse is used as a preconditioner in the iterative solution of Ax = b by Krylov subspace methods. 1. Introduction. We describe a method for computing an incomplete factorization of the inverse of a general sparse matrix A 2 IR nn. The resulting...
متن کاملIterative methods for computing generalized inverses
In this article we extend the method of Yong-Lin Chen (Iterative methods for computing the generalized inverses A (2) T,S of a matrix A, Appl. Math. Comput. 75 (2-3) (1996)) to inifinite dimensional settings. Precisely, we construct an iterative method for computing outer generalized inverses of operators on Banach spaces, and also for computing the generalized Drazin inverse of Banach algebra ...
متن کاملUniversal Iterative Methods for Computing Generalized Inverses
In this paper we construct a few iterative processes for computing {1, 2} inverses of a linear bounded operator, based on the hyper-power iterative method or the Neumann-type expansion. Under the suitable conditions these methods converge to the {1, 2, 3} or {1, 2, 4} inverses. Also, we specify conditions when the iterative processes converge to the Moore-Penrose inverse, the weighted Moore-Pen...
متن کاملSparse Approximate Inverses for Preconditioning of Linear Equations
1. Sparse Approximate Inverses and Linear Equations We consider the problem of solving a system of linear equations Ax = b in a parallel environment. Here, the n n-matrix A is large, sparse, unstructured, nonsymmetric, and ill-conditioned. The solution method should be robust, easy to parallelize, and applicable as a black box solver. Direct solution methods like the Gaussian Elimination are no...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications
سال: 2022
ISSN: ['1095-7162', '0895-4798']
DOI: https://doi.org/10.1137/20m1364126